417B - Crash - CodeForces Solution


implementation *1400

Please click on ads to support us..

Python Code:

import sys
from math import *
from collections import Counter
input=sys.stdin.readline

def isSorted(a):
    for i in range(1, len(a)):
        if a[i] < a[i-1]:
            return False
    return True

d={}
n=int(input())
for i in range(n):
    a,b=map(int,input().split())
    a,b=b,a
        if a in d:
        if b in d[a]:
            continue
        elif b-1 in d[a]:
            d[a].add(b)
        else:
            print("NO")
            exit()
    if not a in d:
        if b==0:
            d[a]=set([b])
        else:
            print("NO")
            exit()
print("YES")

        


Comments

Submit
0 Comments
More Questions

807A - Is it rated
1096A - Find Divisible
1430C - Numbers on Whiteboard
1697B - Promo
208D - Prizes Prizes more Prizes
659A - Round House
1492C - Maximum width
171B - Star
1512B - Almost Rectangle
831B - Keyboard Layouts
814A - An abandoned sentiment from past
268C - Beautiful Sets of Points
1391C - Cyclic Permutations
11A - Increasing Sequence
1406A - Subset Mex
1365F - Swaps Again
50B - Choosing Symbol Pairs
1719A - Chip Game
454B - Little Pony and Sort by Shift
1152A - Neko Finds Grapes
1719B - Mathematical Circus
1719C - Fighting Tournament
1642A - Hard Way
285C - Building Permutation
1719E - Fibonacci Strings
1696C - Fishingprince Plays With Array
1085A - Right-Left Cipher
1508B - Almost Sorted
1690C - Restoring the Duration of Tasks
1055A - Metro